|
A knowledge base KB is complete ''if'' there is no formular α such that KB ⊭ α and KB ⊭ ¬α. Example of knowledge base with incomplete knowledge: KB := Then we have KB ⊭ A and KB ⊭ ¬A. In some cases, you can make a consistent knowledge base complete with the closed world assumption - that is, adding all not-entailed literals as negations to the knowledge base. In the above example though, this would not work because it would make the knowledge base inconsistent: KB' = In the case you have KB := , you have KB ⊭ P(b) and KB ⊭ ¬P(b), so with the closed world assumption you would get KB' = where you have KB' ⊨ ¬P(b). See also: * Vivid knowledge 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Completeness (knowledge bases)」の詳細全文を読む スポンサード リンク
|